IAA-AAS-DyCoSS2 14-05-01 AN HEURISTIC APPROACH TO THE PROBLEM OF INITIAL ORBIT DETERMINATION: A TEST CASE WITH GEO OBSERVATIONS

نویسندگان

  • L. Ansalone
  • F. Curti
چکیده

The orbit determination of a satellite in a geostationary orbit is usually based on optical observations. Telescopes all around the Earth are observing the geostationary ring to obtain periodically new measurements in order to update the estimation of the objects’ orbits. One critical aspect of the orbit determination process is the initial orbit determination because no a priori information are available. This paper proposes a new method based on search algorithms with heuristic principles aming to find the six independent orbital parameters that best fit the observations. A genetic algorithm makes the candidate solutions moving in a solution space of six dimensions. The problem is reduced into a two dimensional space with a Lambert’s solver using the initial and final angular observations. This paper presents the results using a single image acquired by a Earth-based telescope, the acquired streak is correlated to the objects of the NORAD database.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Observations Initial Orbit Determination based on Angle-Only Measurements

A new approach with the ability to use the multiple observations based on the least square approach has been proposed for initial orbit determination. This approach considers the Earth’s Oblateness by using the developed Lagrange coefficients. The efficiency of the proposed method has been tested in two scenarios. The first scenario is to use the simulated and the second one is to utilize the r...

متن کامل

A heuristic approach for multi-stage sequence-dependent group scheduling problems

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

متن کامل

Aas 16-236 Probabilistic Initial Orbit Determination

Future space surveillance requires dealing with uncertainties directly in the initial orbit determination phase. We propose an approach based on Taylor differential algebra to both solve the initial orbit determination (IOD) problem and to map uncertainties from the observables space into the orbital elements space. This is achieved by approximating in Taylor series the general formula for pdf ...

متن کامل

A Heuristic Approach for Solving LIP with the Optional Feasible or Infeasible Initial Solution Points

An interactive heuristic approach can offer a practical solution to the problem of linear integer programming (LIP) by combining an optimization technique with the Decision Maker’s (DM) judgment and technical supervision. This is made possible using the concept of bicriterion linear programming (BLP) problem in an integer environment. This model proposes two bicriterion linear programs for iden...

متن کامل

A Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution

In this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014